Selection Sort in Java
Course- Java >
We can create a java program to sort array elements using selection sort. In selection sort algorithm, we search for the lowest element and arrange it to the proper location. We swap the current element with the next lowest number.
- public class SelectionSortExample {
- public static void selectionSort(int[] arr){
- for (int i = 0; i < arr.length - 1; i++)
- {
- int index = i;
- for (int j = i + 1; j < arr.length; j++){
- if (arr[j] < arr[index]){
- index = j;//searching for lowest index
- }
- }
- int smallerNumber = arr[index];
- arr[index] = arr[i];
- arr[i] = smallerNumber;
- }
- }
- public static void main(String a[]){
- int[] arr1 = {9,14,3,2,43,11,58,22};
- System.out.println("Before Selection Sort");
- for(int i:arr1){
- System.out.print(i+" ");
- }
- System.out.println();
- selectionSort(arr1);//sorting array using selection sort
- System.out.println("After Selection Sort");
- for(int i:arr1){
- System.out.print(i+" ");
- }
- }
- }
Output:
Before Selection Sort 9 14 3 2 43 11 58 22 After Selection Sort 2 3 9 11 14 22 43 58